翻訳と辞書 Words near each other ・ Candidates of the Queensland state election, 1963 ・ Candidates of the Queensland state election, 1986 ・ Candidates of the Queensland state election, 1989 ・ Candidates of the Queensland state election, 1992 ・ Candidates of the Queensland state election, 1995 ・ Candidate division ・ Candidate division TM7 ・ Candidate gene ・ Candidate key ・ Candidate move ・ Candidate of Law ・ Candidate of Medicine ・ Candidate of Philosophy ・ Candidate of Sciences ・ Candidate selection procedure in the United States and the European Union ・ Candidate solution ・ Candidate submittal ・ Candidates in the Cook Islands general election 2010 by electorate ・ Candidates in the New Zealand general election 2005 by electorate ・ Candidates in the New Zealand general election 2005 by party ・ Candidates in the New Zealand general election 2008 by electorate ・ Candidates in the New Zealand general election 2011 by electorate ・ Candidates in the New Zealand general election 2014 by electorate ・ Candidates in the New Zealand general election 2014 by party ・ Candidates in the Philippine House of Representatives elections, 2013 ・ Candidates in the Philippine Senate election, 2013 ・ Candidates nominated to run for the 2011 election of the Northern Ireland Assembly ・ Candidates of the Australian federal election, 1901 ・ Candidates of the Australian federal election, 1903 ・ Candidates of the Australian federal election, 1906 Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Candidate solution ： ウィキペディア英語版 Candidate solution In optimization and other branches of mathematics, and in search algorithms (a topic in computer science), a candidate solution is a member of a set of possible solutions to a given problem. A candidate solution does not have to be a likely or reasonable solution to the problem—it is simply in the set that satisfies all constraints; that is, it is in the set of ''feasible solutions''. Algorithms for solving various types of optimization problems often narrow the set of candidate solutions down to a subset of the feasible solutions, whose points remain as candidate solutions while the other feasible solutions are henceforth excluded as candidates. The space of all candidate solutions, before any feasible points have been excluded, is called the feasible region, feasible set, search space, or solution space. This is the set of all possible solutions that satisfy the problem's constraints. Constraint satisfaction is the process of finding a point in the feasible set. ==Genetic algorithm== In the case of the genetic algorithm, the candidate solutions are the individuals in the population being evolved by the algorithm. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Candidate solution」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.